Dynamic Polynomial Combinants and Generalised Resultants

The theory of constant polynomial combinants has been well developed [2] and it is linked to the linear part of the constant Determinantal Assignment problem [1] that provides the unifying description of the pole and zero assignment problems in Linear Systems. Considering the case of dynamic pole, zero assignment problems leads to the emergence of dynamic polynomial combinants. This paper aims to demonstrate the origin of dynamic polynomial combinants from Linear Systems, and develop the fundamentals of the relevant theory by establishing their link to the theory of Generalised Resultants and examining issues of their parameterization according to the notions of order and degree. The paper provides a description of the key spectral assignment problems, derives the conditions for arbitrary assignability of spectrum and introduces a parameterization of combinants according to their order and degree.